package recursion.leetcode.editor.cn;


import java.util.List;
import java.util.Stack;

public class DifferentWaysToAddParentheses {
    public static void main(String[] args) {
        Solution solution = new DifferentWaysToAddParentheses().new Solution();
        System.out.println(solution.diffWaysToCompute("2-1-1"));
        System.out.println(solution.diffWaysToCompute("2*3-4*5"));
//          示例 1：
//
//          输入：expression = "2-1-1"
//          输出：[0,2]
//          解释：
//          ((2-1)-1) = 0
//          (2-(1-1)) = 2
//          示例 2：
//
//          输入：expression = "2*3-4*5"
//          输出：[-34,-14,-10,-10,10]
//          解释：
//          (2*(3-(4*5))) = -34
//          ((2*3)-(4*5)) = -14
//          ((2*(3-4))*5) = -10
//          (2*((3-4)*5)) = -10
//          (((2*3)-4)*5) = 10

    }

    //leetcode submit region begin(Prohibit modification and deletion)
    class Solution {
        public List<Integer> diffWaysToCompute(String expression) {
            Stack<Integer> number = new Stack<>();
            Stack<String> action = new Stack<>();
            number.add(Integer.valueOf(expression.charAt(0)));
            int length = expression.length();
            for (int i = 0; i < length; i++) {
                while ('0' < expression.charAt(i) && expression.charAt(i) < '9') {
                    i++;
                }
                //number.add(expression.charAt(i))
            }

            return null;
        }
    }
//leetcode submit region end(Prohibit modification and deletion)

}